String processing techniques
نویسندگان
چکیده
منابع مشابه
Practical Algorithmic Techniques for Several String Processing Problems
The domains of data mining and knowledge discovery make use of large amounts of textual data, which need to be handled efficiently. Specific problems, like finding the maximum weight ordered common subset of a set of ordered sets or searching for specific patterns within texts, occur frequently in this context. In this paper we present several novel and practical algorithmic techniques for proc...
متن کاملApproximate String Processing
One of the most important primitive data types in modern data processing is text. Text data are known to have a variety of inconsistencies (e.g., spelling mistakes and representational variations). For that reason, there exists a large body of literature related to approximate processing of text. This monograph focuses specifically on the problem of approximate string matching, where, given a s...
متن کاملString Processing Algorithms
The thesis describes extensive studies on various algorithms for efficient string processing. Data available in/via computers are often of enormous size, and thus, it is significantly important and necessary to invent timeand space-efficient methods to process them. Most of such data are, in fact, stored and manipulated as strings. String matching is most fundamental in string processing, where...
متن کاملString Processing Languages
In programming contexts, the term string usually refers to a sequence of characters. For example, ABC is a string of three characters. Strings are more prevalent in computing than is generally realized. In most cases, computer input is in the form of strings, e.g., commands entered at a terminal. Similarly, computer output is in the form of strings; printed lines are simply strings of character...
متن کاملQuasigroup String Processing
Given a nite setA we consider quasigroup operations n on A and we use them to de ne transformations E n D n A A where A is the set of all nite strings with members from A We show that the mappings E n and D n have several useful properties suitable for many purposes in cryptography coding theory de ning and improving pseudo random generators
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1967
ISSN: 0001-0782,1557-7317
DOI: 10.1145/363427.363444